Finding K Optimum Edit Scripts between an XML Document and a RegularTree Grammar

نویسنده

  • Nobutaka Suzuki
چکیده

Finding optimum and near optimum edit scripts between an XML document and a schema is essential to correcting invalid XML documents. In this paper, we consider finding K optimum edit scripts between an XML document and a regular tree grammar. We first prove that the problem is NP-hard. We next show a pseudopolynomial-time algorithm for solving the problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate XML structure validation based on document-grammar tree similarity

Comparing XML documents with XML grammars, also known as XML document and grammar validation, is useful in various applications such as: XML document classification, document transformation, grammar evolution, XML retrieval, and the selective dissemination of information. While exact (Boolean) XML validation has been extensively investigated in the literature, the more general problem of approx...

متن کامل

Eecient Management of Multiversion Documents by Object Referencing

Traditional approaches to versioning documents are edit-based, and represent successive versions using edit scripts. This paper proposes a reference-based version-ing scheme that preserves the rich logical structure of the evolving document via object references. This approach produces better support for queries, and reconciles the storage-level and transport-level representations of multiversi...

متن کامل

An Evaluation of Inter - Organizational Workflow Modelling Formalisms

INTRODUCTION Ever since the Extensible Markup Language (XML) (W3C, 1998b) began to be used to exchange data between diverse sources, interest has grown in deploying data management technology to store and query XML documents. A number of approaches propose to adapt relational database technology to store The advantage is that the XML repository inherits all the power of mature relational techno...

متن کامل

X-Tree Diff+: Efficient Change Detection Algorithm in XML Documents

As web documents proliferate fast, the need fo real-time computation of change (edit script) between web documents increases. Though fast heuristic algorithms have been proposed recently, the qualities of edit scripts produced by them are not satisfactory. In this paper, we propose X-tree Diff+ which produces better quality of edit scripts by introducing a tuning step based on the notion of con...

متن کامل

Storing XML Documents in Databases

INTRODUCTION Ever since the Extensible Markup Language (XML) (W3C, 1998b) began to be used to exchange data between diverse sources, interest has grown in deploying data management technology to store and query XML documents. A number of approaches propose to adapt relational database technology to store The advantage is that the XML repository inherits all the power of mature relational techno...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007